Algorithms forq -Hypergeometric Summation in Computer Algebra

Algorithms for q-Hypergeometric Summation in Computer Algebra

together with their Maple implementations, which is relevant both to people being interested in symbolic computation and in q-series. For all these algorithms, the theoretical background is already known and has been described, so we give only short descriptions, and concentrate ourselves on introducing our corresponding Maple implementations by examples. Each section is closed with a descripti...

Algorithms for m-Fold Hypergeometric Summation

Hypergeometric summation revisited

We consider hypergeometric sequences i e the sequences which satisfy linear rst order homogeneous recurrence equations with rela tively prime polynomial coe cients Some results related to necessary and su cient conditions are discussed for validity of discrete Newton Leibniz formula P w k v t k u w u v when u k R k t k and R k is a rational solution of Gosper s equation

Algorithms for computer algebra

Computer Algebra Algorithms*

INTRODUCTION ...................................................................................................................... 1 ARITHMETIC ........................................................................................................................... 2 Integer and Polynomial Addition, Multiplication, and Division with Remainder ............. 2 Integer and Polynomial Greatest C...